Incidence coloring of graphs with high maximum average degree

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Incidence coloring of graphs with high maximum average degree

An incidence of an undirected graph G is a pair (v, e) where v is a vertex of G and e an edge of G incident with v. Two incidences (v, e) and (w, f) are adjacent if one of the following holds: (i) v = w, (ii) e = f or (iii) vw = e or f . An incidence coloring of G assigns a color to each incidence of G in such a way that adjacent incidences get distinct colors. In 2005, Hosseini Dolama et al. [...

متن کامل

k-forested choosability of graphs with bounded maximum average degree

A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...

متن کامل

Acyclic 6-coloring of graphs with maximum degree 5 and small maximum average degree

A k-colouring of a graph G is a mapping c from the set of vertices of G to the set {1, . . . , k} of colours such that adjacent vertices receive distinct colours. Such a k-colouring is called acyclic, if for every two distinct colours i and j, the subgraph induced by all the edges linking a vertex coloured with i and a vertex coloured with j is acyclic. In other words, every cycle in G has at l...

متن کامل

k-forested choosability of graphs with bounded maximum average degree

a proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. a graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $g$ such that each vertex receives a color from its own list. in this paper, we prov...

متن کامل

List 3-dynamic coloring of graphs with small maximum average degree

An r-dynamic k-coloring of a graph G is a proper k-coloring φ such that for any vertex v, v has at least min{r, degG(v)} distinct colors in NG(v). The r-dynamic chromatic number χr(G) of a graph G is the least k such that there exists an r-dynamic k-coloring of G. The list r-dynamic chromatic number of a graph G is denoted by chr(G). Recently, Loeb, Mahoney, Reiniger, and Wise showed that the l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2017

ISSN: 0166-218X

DOI: 10.1016/j.dam.2017.04.029